Concurrent transmission of multiple signals in a wireless network

ABSTRACT

A method for concurrent transmission of multiple radio-frequency signals in a wireless network. The method is executed at a node of the wireless network and makes use of the node&#39;s knowledge of local network topology, locations of certain packets in the node&#39;s neighborhood, and local state of the radio-frequency (RF) channel to identify a relatively wide range of different opportunities for zero-forcing, aligning, and/or canceling unwanted RF signals at the receiving node(s). The identified opportunities are communicated to the neighbor nodes to advantageously cause concurrent transmissions of a relatively large number of packets.

BACKGROUND

1. Field of the Invention

The present invention relates to wireless networks and, more specifically but not exclusively, to identification and use of zero-forcing, interference-alignment, and/or interference-cancellation opportunities for wireless transmissions.

2. Description of the Related Art

This section introduces aspects that may help facilitate a better understanding of the invention(s). Accordingly, the statements of this section are to be read in this light and are not to be understood as admissions about what is in the prior art or what is not in the prior art.

Wireless interference is typically considered harmful. As result, a wireless network is usually configured to prevent transmitters from interfering with one another. For example, a wireless network might be configured to allocate the wireless medium to a specified transmitter using time division multiple access (TDMA) or to employ a contention-based collision-avoidance mechanism similar to that of IEEE 802.11. However, as unicast wireless transmissions approach the Shannon capacity, it becomes progressively more difficult to realize further throughput increases without allowing concurrent transmissions and the concomitant signal interference. While some prior-art techniques allow concurrent transmission of multiple wireless signals, each of such techniques typically targets only a corresponding, very specifically and narrowly defined type of concurrent-transmission opportunities and, as such, misses and leaves unutilized many other beneficial opportunities.

SUMMARY

Disclosed herein are various embodiments of a method for concurrent transmission of multiple radio-frequency signals in a wireless network. The method is executed at a node of the wireless network and makes use of the node's knowledge of local network topology, locations of certain packets in the node's neighborhood, and local state of the radio-frequency (RF) channel to identify a relatively wide range of different opportunities for zero-forcing, aligning, and/or canceling unwanted RF signals at the receiving node(s). The identified opportunities are communicated to the neighbor nodes to advantageously cause concurrent transmissions of a relatively large number of packets.

According to one embodiment, provided is, at a first node of a wireless network, a node-implemented method for concurrent transmission of multiple radio-frequency signals between a plurality of transmitting and receiving nodes of the wireless network, the method having the steps of: (A) for a selected time slot, collecting packet-availability information for nodes located within a selected number of hops from the first node; (B) determining a subset of packets corresponding to the packet-availability information that is suitable for concurrent transmission in the selected time slot by considering, for the selected time slot, two or more of (i) zero-forcing, (ii) interference-alignment, and (iii) interference-cancellation; (C) identifying a set of transmitting nodes corresponding to the subset of packets; and (D) transmitting one or more trigger messages to said set of transmitting nodes to cause the concurrent transmission of the subset of packets in the selected time slot.

According to another embodiment, provided is a node for a wireless network, the wireless network being adapted for concurrent transmission of multiple radio-frequency signals between a plurality of transmitting and receiving nodes. The node is adapted to: (A) for a selected time slot, collect packet-availability information for nodes located within a selected number of hops from the first node; (B) determine a subset of packets corresponding to the packet-availability information that is suitable for concurrent transmission in the selected time slot by considering, for the selected time slot, two or more of (i) zero-forcing, (ii) interference-alignment, and (iii) interference-cancellation; (C) identify a set of transmitting nodes corresponding to the subset of packets; and (D) transmit one or more trigger messages to said set of transmitting nodes to cause the concurrent transmission of the subset of packets in the selected time slot.

BRIEF DESCRIPTION OF THE DRAWINGS

Other aspects, features, and benefits of various embodiments of the invention will become more fully apparent, by way of example, from the following detailed description and the accompanying drawings, in which:

FIG. 1 shows a diagram of a representative wireless network, in which various embodiments of the invention can be practiced;

FIGS. 2A-F illustrate various opportunities for concurrent transmissions in a wireless network that is analogous to the network of FIG. 1;

FIG. 3 shows a flowchart of a method for generating concurrent wireless transmissions that can be used in the network of FIG. 1 according to one embodiment of the invention; and

FIG. 4 illustrates an application of the method shown in FIG. 3 to a system having two degrees of freedom according to one embodiment of the invention.

DETAILED DESCRIPTION

FIG. 1 shows a diagram of a representative wireless network 100, in which various embodiments of the invention can be practiced. Network 100 is a mesh network having a plurality of nodes 110. Each node 110 is adapted to perform several functions. For example, node 110 can serve as an access point (AP) for one or more mobile terminals (MTs), such as MTs 120 ₁-120 ₃, present in the area. Each MT 120 can gain access to network 100 by establishing a wireless communication link 115 with a corresponding one of nodes 110 (usually the node providing the strongest reception). After gaining access to network 100, MT 120 becomes an end node of the network. Node 110 can further serve as a backhaul router that enables network 100 to relay communication signals, via wireless links 105, from node to node. Some of nodes 110, e.g., node 110 _(i) and node 110 _(p), can further serve as gateways that connect network 100, via respective wireline or wireless links 125, to an external network 130, e.g., the Internet or a private wireline network. The mesh topology of network 100 provides propagation-path diversity for substantially any communicating pair of nodes 110, meaning that there typically exist at least two different signal-propagation routes between those nodes.

If configured in accordance with an embodiment of the invention, network 100 is capable of supporting concurrent wireless transmissions between different nodes 110 and/or between nodes 110 and MTs 120. For example, in one embodiment, each node 110 runs an algorithm for identifying zero-forcing, interference-alignment, and/or interference-cancellation opportunities at receiving nodes. Various embodiments of the algorithm are described below in reference to FIGS. 2-4. Briefly, the algorithm might rely on one or more of (i) the node's knowledge of the local network topology, (ii) the node's knowledge of the channel state, and (iii) opportunistically received signals and/or packets to systematically identify and track opportunities for concurrent wireless transmissions in cooperation with neighbor nodes. Advantageously, the use of the identified opportunities enables network 100 to increase its throughput capacity by at least about 50%.

Illustrative Opportunities for Concurrent Wireless Transmissions FIGS. 2A-F illustrate representative opportunities for concurrent transmissions in a wireless network that is analogous to network 100 (FIG. 1). Various embodiments of the algorithm(s) described below in reference to FIGS. 3-4 are capable of systematically identifying some or all of the opportunities illustrated in FIGS. 2A-F.

The following nomenclature is adhered to in the description of FIGS. 2A-F:

-   -   s is a sender node. Any of nodes 110 and MTs 120 can serve as         node s;     -   d is a destination node. Any of nodes 110 and MTs 120 can serve         as node d, and there can be one or more destination nodes d for         a given sender node s;     -   u and v are intermediate nodes. Any of nodes 110 can serve as an         intermediate node;     -   pkt_(i) is a data packet intended for transmission from sender         node s_(i) to destination node d_(i); and     -   x_(i) is a radio-frequency (RF) signal that encodes and         represents data packet pkt_(i) in the physical (PHY) layer.         Signal x_(i) is also referred to as a “native” RF signal         corresponding to packet pkt_(i).         Each of nodes s, d, u, and v is assumed to have a single         antenna. A straight solid line connecting two nodes in FIGS.         2A-F means that there is a transmission edge between those two         nodes. Conversely, an absence of a straight solid line between         two nodes means that there is no transmission edge between those         two nodes. As used herein, the term “transmission edge” refers         to the ability of two nodes to successfully exchange (send         and/or receive) packets without relying on any intermediate         nodes and without exceeding the maximum permitted RF power. The         absence of a transmission edge between two nodes is usually         caused by a large distance and/or unfavorable topography         separating the nodes.

Referring to FIG. 2A, without zero forcing, interference alignment, and/or interference cancellation, it takes a total of four time slots for packets pkt₁ and pkt₂ to reach their respective destinations (i.e., for packet pkt₁ to go from s₁ to d₁, and for packet pkt₂ to go from s₂ to d₂). More specifically, each of the four time slots is used for a one-hop unicast transmission of the corresponding one packet. For example, in time slot 1, packet pkt₁ is transmitted from s₁ to u₁; in time slot 2, packet pkt₂ is transmitted from s₂ to u₂; in time slot 3, packet pkt₁ is transmitted from u₁ to d₁; and, in time slot 4, packet pkt₂ is transmitted from u₂ to d₂.

Since node u₃ has transmission edges with each of the other aforementioned nodes, node u₃ can be used for zero forcing. For example, the following transmission scheme can be implemented. In time slot 1, packet pkt₁ is transmitted from node s₁ to node u₁. Since node u₃ has a transmission edge with node s₁, node u₃ overhears the transmission of pkt₁. In time slot 2, packet pkt₂ is transmitted from node s₂ to node u₂. Since node u₃ has a transmission edge with node s₂, node u₃ overhears the transmission of packet pkt₂. In time slot 3, nodes u₁ and u₂ concurrently transmit packets pkt₁ and pkt₂, respectively, to their respective destination nodes d₁ and d₂. At the same time, u₃ transmits a linear combination of signals x₁ and x₂, with the scaling coefficients in the linear combination selected so as to null the x₂ component at d₁ and the x₁ component at d₂. Due to the “help” from u₃, each of nodes d₁ and d₂ receives a scaled version of the wanted RF signal (i.e., x₁ and x₂, respectively) without interference from the unwanted signal and, hence, can decode the received RF signal using conventional decoding methods. As a result, packets pkt₁ and pkt₂ are delivered to their respective destinations in three time slots instead of four.

Referring to FIG. 2B, without zero forcing, interference alignment, and/or interference cancellation, it takes three time slots for packets pkt₁ and pkt₂ to reach their respective destinations. Each of the three time slots is used for a one-hop unicast transmission of the corresponding one packet. For example, in time slot 1, packet pkt₁ is transmitted from s₁ to u₁; in time slot 2, packet pkt₂ is transmitted from s₂ to d₂; and, in time slot 3, packet pkt₁ is transmitted from u₁ to d₁.

With an appropriate “help” from node u₂, the number of time slots can be reduced from three to two. For example, in time slot 1, nodes s₁ and s₂ can concurrently transmit packets pkt₁ and pkt₂, respectively. Since there is no transmission edge between s₁ and d₂, node d₂ receives signal x₂ without interference from signal x₁ and can decode the former using conventional methods. Due to the presence of transmission edges between nodes s₁, s₂, u₁, and u₂, each of nodes u₁ and u₂ receives, in time slot 1, a respective (different) linear combination of signals x₁ and x₂. Then, in time slot 2, nodes u₁ and u₂ appropriately scale the signals received in time slot 1 and concurrently transmit the resulting scaled signals. The scaling coefficients used by nodes u₁ and u₂ are selected so as to null the x₂ component at node d₁, which enables d₁ to recover packet pkt₁ from the received signal using conventional decoding methods.

Referring to FIG. 2C, without zero forcing, interference alignment, and/or interference cancellation, it takes four time slots for packets pkt₁ and pkt₂ to reach their respective destinations. Each of the four time slots is used for a one-hop unicast transmission of the corresponding one packet. For example, in time slot 1, packet pkt₁ is transmitted from s₁ to u₁; in time slot 2, packet pkt₂ is transmitted from s₂ to u₂; in time slot 3, packet pkt₁ is transmitted from u₁ to d₁; and, in time slot 4, packet pkt₂ is transmitted from u₂ to d₂.

With an appropriate “help” from nodes v₁ and v₂, the number of time slots can be reduced from four to two. For example, in time slot 1, nodes s₁ and s₂ can concurrently transmit packets pkt₁ and pkt₂, respectively. Due to the presence of transmission edges between nodes s₁, s₂, u₁, u₂, v₁, and v₂, the four intermediate nodes (i.e., u₁, u₂, v₁, and v₂) receive, in time slot 1, four respective (different) linear combinations of signals x₁ and x₂. Then, in time slot 2, intermediate nodes u₁, u₂, v₁, and v₂ appropriately scale their respective signals received in time slot 1 and concurrently transmit the resulting scaled signals. Without the “help” from intermediate nodes v₁ and v₂, each of destination nodes d₁ and d₂ would have received, in time slot 2, a respective linear combination of signals x₁ and x₂ that might not have been decodable. However, with the “help” from intermediate nodes v₁ and v₂, each of destination nodes d₁ and d₂ receives a scaled version of the respective wanted signal (i.e., x₁ and x₂, respectively) without interference from the respective unwanted one. More specifically, intermediate node v₁ uses a scaling coefficient that causes the x₂ component to be nulled at node d₁ while the x₁ component is being presented in a decodable form. Similarly, intermediate node v₂ uses a scaling coefficient that causes the x₁ component to be nulled at node d₂ while the x₂ component is being presented in a decodable form.

Referring to FIG. 2D, without zero forcing, interference alignment, and/or interference cancellation, it takes four time slots for packets pkt₁ and pkt₂ to reach their respective destinations. Each of the four time slots is used for a one-hop unicast transmission of the corresponding one packet. For example, in time slot 1, packet pkt₁ is transmitted from s₁ to u₁; in time slot 2, packet pkt₂ is transmitted from s₂ to u₂; in time slot 3, packet pkt₁ is transmitted from u₁ to d₁; and, in time slot 4, packet pkt₂ is transmitted from u₂ to d₂.

With interference cancellation, the following transmission scheme can be implemented. In time slot 1, nodes s₁ and s₂ concurrently transmit packets pkt₁ and pkt₂, respectively. Because node u₁ has transmission edges with both nodes s₁ and s₂, node u₁ receives, in time slot 1, a linear combination of signals x₁ and x₂. In contrast, each of nodes d₁ and u₂ receives only signal x₂. In time slot 2, nodes u₁ and u₂ concurrently retransmit their respective signals without any particular scaling or encoding. Because node d₂ has a transmission edge only with node u₂, node d₁ receives, in time slot 2, the wanted signal x₂ without interference from the unwanted signal x₁. In contrast, node d₁ has transmission edges with both intermediate nodes u₁ and u₂ and, therefore, receives, in time slot 2, a linear combination of signals x₁ and x₂. However, node d₁ already “knows” signal x₂ because it was received earlier, in time slot 1. Therefore, node d₁ can use this knowledge to remove (cancel) the x₂ component from the mixed signal received in time slot 2, thereby obtaining signal x₁ in a decodable form.

To implement the above-outlined transmission scheme, node u₁ can serve as a coordinating node that transmits a corresponding triggering message. The triggering message is transmitted prior to time slot 1 and instructs nodes s₁ and s₂ to concurrently transmit signals x₁ and x₂ during time slot 1. The triggering message also instructs node u₂ to transmit immediately thereafter concurrently with node u₁ and informs node d₁ of its decoding vector. In one embodiment, the triggering message can be a MAC (medium access control)-layer message that is piggybacked onto an earlier packet transmitted by node u₁. Assuming that the triggering message does not require a dedicated time slot, the above-outlined transmission scheme reduces the number of time slots from four to two.

Referring to FIG. 2E, node s is the sender node for both packets pkt₁ and pkt₂. Without zero forcing, interference alignment, and/or interference cancellation, it takes six time slots for packets pkt₁ and pkt₂ to reach their respective destinations. Each of the six time slots is used for a one-hop unicast transmission of the corresponding one packet. For example, in time slot 1, packet pkt₁ is transmitted from s to u₁; in time slot 2, packet pkt₂ is transmitted from s to u₂; in time slot 3, packet pkt₁ is transmitted from u₁ to v₁; in time slot 4, packet pkt₂ is transmitted from u₂ to v₂; in time slot 5, packet pkt₁ is transmitted from v₁ to d₁; and, in time slot 6, packet pkt₂ is transmitted from v₂ to d₂.

With zero forcing, the following transmission scheme can be implemented by the nodes of FIG. 2E. In time slot 1, packet pkt₁ is transmitted from s to u₁. In time slot 2, packet pkt₂ is transmitted from s to u₂. In time slot 3, nodes u₁ and u₂ concurrently transmit respective linear combinations of signals x₁ and x₂ to nodes v₁ and v₂. In time slot 4, nodes v₁ and v₂ amplify their respective received signals using the same gain and concurrently transmit the resulting amplified signals to nodes d₁ and d₂.

Let us denote the channel-state matrix for the transmission channel between nodes u₁, u₂ and v₁, v₂ as H₁ and the channel-state matrix for the transmission channel between nodes v₁, v₂ and d₁, d₂ as H₂. Let us further denote the encoding vector used in time slot 3 at node u_(i) as ω_(i), where i=1, 2, wherein the encoding vector has two components, each being the weighting coefficient that is used to scale the corresponding one of signals x₁ and x₂ to produce the transmitted linear combination of signals x₁ and x₂. Suppose now that nodes u₁ and u₂ are configured to use encoding vectors ω₁ and ω₂ that satisfy Eq. (1):

[ω₁ω₂]^(T)=(H ₁ H ₂)⁻¹  (1)

where superscript T means transposed. Then, it can be shown that signals y₁ and y₂ received in time slot 4 by nodes d₁ and d₂, respectively, satisfy Eq. (2):

[y₁y₂]^(T)=Γ[x₁x₂]^(T)  (2)

where Γ is a diagonal matrix (e.g., a square matrix in which the entries outside the main diagonal are all zero). Eq. (2) means that nodes d₁ and d₂ can recover packets pkt₁ and pkt₂ from received signals y₁ and y₂, respectively, using conventional decoding methods. As a result, the above-outlined transmission scheme reduces the number of time slots from six to four.

Referring to FIG. 2F, let us suppose that the network routes packet pkt₁ from node s₁ to node d₁ via node s₂, while packet pkt₂ is routed from node s₂ to node d₂. Then, without zero forcing, interference alignment, and/or interference cancellation, it takes three time slots for packets pkt₁ and pkt₂ to reach their respective destinations. Each of the three time slots is used for a one-hop unicast transmission of the corresponding one packet. For example, in time slot 1, packet pkt₁ is transmitted from s₁ to s₂; in time slot 2, packet pkt₂ is transmitted from s₂ to d₂; and, in time slot 3, packet pkt₁ is transmitted from s₂ to d₁. In this transmission scheme, node s₂ is functioning as both a source node and an intermediate node.

However, if packet pkt₁ is rerouted via node u₁, then interference cancellation can be used to reduce the number of time slots from three to two. More specifically, in time slot 1, nodes s₁ and s₂ can transmit concurrently. Due to the shown configuration of transmission edges, both nodes d₁ and d₂ will receive signal x₂ without interference from signal x₁. In contrast, node u₁ will receive a mixed signal having both x₁ and x₂ signal components. In time slot 2, node u₁ amplifies the received mixed signal and transmits the resulting amplified signal to node d₁. Upon receipt of the mixed signal in time slot 2, node d₁ uses its knowledge of signal x₂ acquired in time slot 1 to remove the x₂ component from the mixed signal, thereby obtaining signal x₁ in a decodable form.

In summary, FIGS. 2A-F exemplify the following opportunities for concurrent wireless transmissions. FIGS. 2A-C show that one or more helper nodes can be invoked to take advantage of zero-forcing and/or interference-cancellation techniques for relaying packets from sender nodes to destination nodes in fewer time slots than without such techniques. As used herein, the term “helper node” refers to a node whose participation in packet transmission is not required or necessary for delivering a packet from a sender node to a destination node under a conventional unicast-transmission scheme, but whose participation in packet transmission enables zero forcing and/or interference cancellation to be performed. FIG. 2A shows an opportunity for concurrent wireless transmissions, in which a helper node had opportunistically received (overheard) native RF signals. FIGS. 2B-C show opportunities for concurrent wireless transmissions, in which a helper node had opportunistically received mixed RF signals, e.g., RF signals corresponding to linear combinations of native RF signals. FIG. 2D shows an opportunity for concurrent wireless transmissions, in which no helper nodes are invoked but one or more of the participating nodes take advantage of opportunistically received RF signals resulting from a favorable local transmission-edge configuration. FIG. 2E shows an opportunity for concurrent wireless transmissions, in which the participating intermediate nodes located two hops away from the destination nodes use channel-state information to generate appropriate mixed signals whose retransmission by the downstream nodes effectively nulls signal interference at the destination nodes. FIG. 2F shows an opportunity for concurrent wireless transmissions, in which one of the signals is rerouted to enable the use of an opportunistically received signal for interference cancellation.

Identification of Opportunities for Concurrent Wireless Transmissions

Each of the algorithms (methods) described in this subsection is designed for implementation at a node of a wireless network, such as node 110 of network 100. All or only some of the nodes in the network might run a selected algorithm, with different nodes running separate independent copies (instances) of the algorithm. Unless explicitly stated otherwise, the description below assumes that all nodes use the same fixed transmission rate. One skilled in the art will appreciate that the described fixed-rate algorithms can be extended in a relatively straightforward manner to a configuration in which multiple transmission rates are permitted. The algorithms described herein rely on one or more of (i) opportunistically received, native or mixed RF signals, (ii) local transmission graph G, (iii) local interference graph G_(I), (iv) estimates of local channel-state matrix H, and (v) network-layer traffic-flow information. Sizes of the graphs and the rank of the channel-state matrix can be limited, e.g., by taking into consideration only the network neighborhood within a specified number of hops (e.g., two hops) from the node implementing the algorithm. FIGS. 2A-F are examples of local transmission graphs.

The description of FIGS. 2A-F in the preceding subsection implicitly assumes that the transmission and interference graphs are the same. In a more-general case, transmission and interference graphs might differ from one another because the signal threshold used for the detection of interference is different from the signal threshold used for the determination of whether or not two nodes have a transmission edge between them. A node can compose its transmission and interference graphs based, e.g., on a rolling-call procedure, during which different nodes take turns broadcasting a calibration signal while the non-transmitting nodes are “listening” and comparing the respective received signals with appropriate signal thresholds. Representative procedures for estimating channel-state matrix H are disclosed, e.g., in U.S. Pat. Nos. 7,653,142, 7,647,073, and 7,623,561, all of which are incorporated herein by reference in their entirety.

The number of independent signals that can concurrently be transmitted by a single transmitting node (e.g., node 110, FIG. 1) is referred to as the DOF (degree of freedom) number. In general, if a transmitter has multiple antennas, then each of those antennas corresponds to at least one degree of freedom. Each independent transmission frequency is also counted as a degree of freedom. For example, IEEE 802.11a/g stipulates the use of 48 sub-carriers, each of which can be counted as a degree of freedom. If a transmitter has M antennas and uses Q sub-carriers, then that transmitter has M×Q degrees of freedom. For clarity, the algorithms described herein are discussed in reference to DOF=1 or 2. One skilled in the art will appreciate that these algorithms can be extended in a relatively straightforward manner to any other DOF number.

Cooperation of multiple nodes in producing concurrent transmissions can be enabled by MAC-layer signaling. For example, when a node identifies one or more opportunities for concurrent wireless transmissions, it can trigger these concurrent transmissions by sending appropriate information about the identified opportunities to its neighbor nodes. This information can be piggybacked, e.g., on conventional ACK (acknowledgement) or DATA packets.

FIG. 3 shows a flowchart of a method 300 for generating concurrent wireless transmissions that can be used in network 100 (FIG. 1) according to one embodiment of the invention. For illustration purposes, method 300 is first described for DOF=1. Application of method 300 to a representative case of DOF=2 is given below in reference to FIG. 4. For each time slot, the corresponding set of transmitting nodes is assumed to be non-overlapping with the corresponding set of receiving nodes, i.e., a node is assumed to be able to transmit or receive, but not both at the same time.

At step 302, the node running method 300 collects packet-availability information for the nodes located in its neighborhood. In one embodiment, the node arranges the collected packet-availability information in form of a packet-availability matrix A. Each matrix element a_(ik) of matrix A is either 1 or 0. More specifically, if the i-th node from local transmission graph G has the k-th packet, then a_(ik)=1, where i is the node ID and k is the packet ID. If the i-th transmitting node does not have the k-th packet, then a_(ik)=0. Packet-availability information in general and packet-availability matrix A in particular can be compiled, e.g., based on network-layer routing information and opportunistically overheard transmissions that occurred in previous time slots in the node's neighborhood. One skilled in the art will appreciate that the content of packet-availability matrix A depends on the time slot intended for the concurrent transmission and changes over time. Provided that local transmission graph G is unchanged, the overall format of packet-availability matrix A remains unchanged as well.

For example, for the local transmission graph shown in FIG. 2A, a fragment A_(f) of packet-availability matrix A corresponding to time slot 3 is given by Eq. (3):

$\begin{matrix} {A_{f} = \begin{bmatrix} 1 & 0 \\ 0 & 1 \\ 1 & 1 \end{bmatrix}} & (3) \end{matrix}$

The first column of fragment A_(f) expresses the fact that nodes u₁ and u₃ have packet pkt₁ at the beginning of time slot 3. The second column of fragment A_(f) expresses the fact that nodes u₂ and u₃ have packet pkt₂ at the beginning of time slot 3.

At step 304, for each k, the node running method 300 computes a set of parameters σ_(k). The physical meaning of an individual parameter σ_(k) is the maximum number of receiving nodes that can receive their intended packets even if packet pkt_(k) is transmitted during the same time slot. An algorithm used for the calculation of parameter σ_(k) depends on whether or not the knowledge of channel-state matrix H is complete. If the knowledge is complete, then all matrix elements of channel-state matrix H are known. If the knowledge of H is incomplete, then one or more matrix elements of channel-state matrix H are not known. Computation of parameter σ_(k) when some matrix elements of channel-state matrix H are not known is provided below after the description of FIG. 4.

If the knowledge of channel-state matrix H is complete, then the set of parameters σ_(k) is computed by summing up matrix elements a_(ik) corresponding to each particular k. For fragment A_(f) given by Eq. (3), summation performed over each of the two columns produces σ₁=σ₂=2. In a more-general case, parameters σ_(k) corresponding to different k's might be different. The computed parameters σ_(k) are sorted in an ascending magnitude order so that σ_(k1)≦σ_(k2)≦ . . . σ_(k) _(K) , where K is the total number of packets considered for concurrent transmission; k₁ is the packet ID for the packet with the smallest σ value; k₂ is the packet ID for the packet with the second smallest σ value; etc.

At step 306, the node running method 300 analyzes the local transmission graph to determine the largest subset of packets from the K packets corresponding to packet-availability matrix A that can satisfy the following condition: if N is the size of the subset, then, for each packet in the subset, there are at least N nodes that have the packet and are able to transmit the packet to the intended receiving node(s). For example, if there are K=10 packets and N=4, then this means that, for each of N=4 packets (out of the total of K=10 packets), there are at least N=4 nodes that have the packet and can transmit the packet to the corresponding intended receiving node(s). This condition ensures that there is a sufficient number of transmitting nodes, each having appropriate transmission edges, so that, collectively, the transmitting nodes can align and/or zero-force the unwanted signal components at each receiving node. In mathematical terms, this condition means that there is a sufficient number of independent linear equations that mix different transmitted signals so that the weighting coefficients in those equations can be selected to present, to each intended receiver, the corresponding wanted signal in a decodable form.

If the identified largest subset of packets can be transmitted using more than one combination (set) of transmitting nodes, then those combinations of transmitting nodes are further analyzed to identify among them an optimal combination of transmitting nodes. In one embodiment, an optimal combination is a node set that has a minimum possible number of transmitting nodes. In other embodiments, other suitable criteria might be used to determine which combination of transmitting nodes is “optimal.”

The following piece of pseudo-code provides a first exemplary implementation of step 306.

306-1: Let PKT be a set of packets to be transmitted, and |PKT| be the number of packets in PKT; 306-2: Let p=1; 306-3: While |PKT| > σ_(k) _(p) , where σ_(k) _(p) is the corresponding one of ordered parameters σ_(k);   PKT = PKT − {pkt_(k) _(p) };   p=p+1; End while; 306-4: Let U* be a full set of transmitting nodes corresponding to PKT; 306-5: Let U be a subset of U*; 306-6: For any transmitting node u_(i) ε U* − U ;  if u_(i) is removed from U*, then each pkt ε PKT still has  at least |PKT| available transmitting nodes;   U* = U* − {u_(i)}; End for. Sub-steps 306-1-306-3 identify the above-defined largest subset of packets within the set of packets corresponding to packet-availability matrix A. Sub-steps 306-4-306-6 identify the above-defined optimal set of transmitting nodes.

At step 308, the node running method 300 transmits trigger messages to the nodes of the optimal set of transmitting nodes identified at step 306. In one embodiment, a trigger message lists all nodes of the optimal set to enable each of said nodes to determine appropriate weighting coefficients for the transmitted native or mixed signals (also see the description of encoding vector ω_(i) given in reference to Eqs. (1)-(2)). Upon receipt of the trigger messages, the nodes of the optimal set of transmitting nodes encode signals using the determined weighting coefficients and concurrently transmit the resulting encoded signals. If a node receives two or more conflicting trigger messages, then conventional conflict-resolution techniques can be used to select one of the trigger messages for action and discard the remaining ones. For example, a trigger message that, if acted upon, results in a concurrent transmission of the largest number of packets might be selected for action. Two trigger messages are conflicting with one another if they identify a node as a transmitting node for the same time slot, but for different concurrent transmission schemes.

FIG. 4 illustrates an application of method 300 to a case of DOF=2 according to one embodiment of the invention. More specifically, FIG. 4 shows a subset 400 of seven nodes, each having two antennas (hence, DOF=2). There are four transmitting nodes labeled s₁-s₄ and three receiving nodes labeled d₁-d₃. Transmission edges between the transmitting and receiving nodes are shown by the dotted lines. Transmitting nodes s₁-s₄ have packets pkt₁-pkt₄, respectively. In addition, node s₁ has packets pkt₂ and pkt₃, which it had previously opportunistically received. The destination nodes for packets pkt₁-pkt₄ are nodes d₁, d₂, d₃, and d₁, respectively.

Since each node has two antennas, each transmitted signal and each received signal is a vector in the antenna space, with the first vector component corresponding to the first antenna of the transmitting/receiving node and the second vector component corresponding to the second antenna of the transmitting/receiving node. For example, any node s can transmit native signal x as vector X expressed by Eq. (4):

$\begin{matrix} {X = {{Cx} \equiv {\begin{bmatrix} c_{a} \\ c_{b} \end{bmatrix}x}}} & (4) \end{matrix}$

where C is the antenna partition vector for the specific packet encoded in native signal x, whose first component (c_(a)) is the scaling factor with which signal x is applied to the first antenna of node s, and whose second component (c_(b)) is the scaling factor with which signal x is applied to the second antenna of node s. Similarly, any signal Y received by node d is a vector signal expressed by Eq. (5):

$\begin{matrix} {Y = \begin{bmatrix} y_{a} \\ y_{b} \end{bmatrix}} & (5) \end{matrix}$

where the first component (y_(a)) of signal Y is the signal received through the first antenna of node d, and the second component (y_(b)) of signal Y is the signal received through the second antenna of node d.

Packet-availability matrix A corresponding to FIG. 4 is given by Eq. (6):

$\begin{matrix} {A = \begin{bmatrix} 1 & 1 & 1 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{bmatrix}} & (6) \end{matrix}$

Analysis of this packet-availability matrix and of the local transmission graph in accordance with sub-steps 306-1-306-6 of method 300 reveals that all four packets can be transmitted concurrently in a single time slot as follows. Node s₁ transmits a linear combination of signals x₁, x₂, and x₃ using antenna partition vectors C₁, C₅, and C₆, respectively. Node s₂ transmits signal x₂ using antenna partition vector C₂. Node s₃ transmits signal x₃ using antenna partition vector C₃. Node s₄ transmits signal x₄ using antenna partition vector C₄.

Assuming, for clarity, that channel-state matrix H is antenna-independent and denoting the matrix element of H corresponding to the wireless channel between the i-th transmitting node and the j-th receiving node as H_(u), one arrives at the following expression for signals Y₁, Y₂, and Y₃ received by nodes d₁, d₂, and d₃, respectively:

$\begin{matrix} {\begin{bmatrix} Y_{1} \\ Y_{2} \\ Y_{3} \end{bmatrix} = {\begin{bmatrix} {H_{11}C_{1}} & {H_{41}C_{4}} & {{H_{21}C_{2}} + {H_{11}C_{5}}} & {{H_{31}C_{3}} + {H_{11}C_{6}}} \\ {H_{12}C_{1}} & {H_{42}C_{4}} & {{H_{22}C_{2}} + {H_{12}C_{5}}} & {{H_{32}C_{3}} + {H_{12}C_{6}}} \\ {H_{13}C_{1}} & {H_{43}C_{4}} & {{H_{23}C_{2}} + {H_{13}C_{5}}} & {{H_{33}C_{3}} + {H_{13}C_{6}}} \end{bmatrix}\begin{bmatrix} x_{1} \\ x_{4} \\ x_{2} \\ x_{3} \end{bmatrix}}} & (7) \end{matrix}$

If antenna partition vectors C₁ through C₆ are selected to satisfy Eqs. (8a-8d):

H ₂₁ C ₂ +H ₁₁ C ₅=0  (8a)

H ₃₁ C ₃ +H ₁₁ C ₆=0  (8b)

H ₁₂ C ₁ =H ₄₂ C ₄ =H ₃₂ C ₃ +H ₁₂ C ₆  (8c)

H ₁₃ C ₁ =H ₄₃ C ₄ =H ₂₃ C ₂ +H ₁₃ C ₅  (8d)

then the following is true.

The contributions of unwanted native signals x₂ and x₃ into signal Y₁ are zero-forced as indicated by the vector diagram shown in FIG. 4 next to node d₁. Node d₁ can decode each of wanted native signals x₁ and x₄, e.g., by projecting, in the antenna space, one of these signals onto the axis orthogonal to the other signal. In mathematical terms, the two antennas of node d₁ provide a system of two independent linear equations for wanted native signals x₁ and x₄, which can be solved to determine both of these native signals.

The contributions of unwanted native signals x₁, x₃, and x₄ into signal Y₂ are aligned with one another as indicated by the vector diagram shown in FIG. 4 next to node d₂. Node d₂ can decode wanted native signal x₂, e.g., by projecting that signal, in the antenna space, onto the axis orthogonal to the aligned signals. In mathematical terms, the two antennas of node d₂ provide a system of two independent linear equations for wanted native signal x₂ and the combined aligned signal, which can be solved to determine native signal x₂.

The contributions of unwanted native signals x₁, x₂, and x₄ into signal Y₃ are aligned with one another as indicated by the vector diagram shown in FIG. 4 next to node d₃. Node d₃ can decode wanted native signal x₃, e.g., by projecting that signal, in the antenna space, onto the axis orthogonal to the aligned signals. In mathematical terms, the two antennas of node d₃ provide a system of two independent linear equations for wanted native signal x₃ and the combined aligned signal, which can be solved to determine native signal x₃.

In general, at step 306, method 300 determines suitable weighting coefficients and/or antenna partition vectors for the nodes of the identified optimal combination of transmitting nodes by attempting, for each receiving node, to either zero-force or align the contributions of unwanted signals into the received signal. If side information is available at some or all of the receiving nodes, then method 300 can determine suitable weighting coefficients and antenna partition vectors by additionally considering interference cancellation as an available technique for recovering wanted native signals. As used herein, the term “side information” refers to a prior opportunistic knowledge, by a receiving node, of packets and/or signals that are being transmitted in the present time slot. The description of FIG. 2D in the preceding subsection provides a representative example of how side information might be acquired.

One skilled in the art will appreciate that weighting coefficients and antenna partition vectors can similarly be determined when channel-state matrix H is antenna dependent. Such antenna dependency will manifest itself as an increase in the number of matrix elements in H. For example, the state of the wireless channel between two two-antenna nodes will be described by four matrix elements in an antenna-dependent case, as opposed to only one matrix element in an antenna-independent case.

Referring back to FIG. 3 and step 304 of method 300, we now describe how parameter σ_(k) is computed when the knowledge of channel-state matrix H is incomplete. With some matrix elements of H missing, some putative transmitters of packet pkt_(k) will be unable to determine proper weighting coefficients and/or antenna-partition vectors, e.g., in a manner similar to that described above in reference to Eqs. (7)-(8). As a consequence, these transmitters need to be excluded from consideration for participation in concurrent transmissions.

To calculate the set of parameters σ_(k) at step 304 of method 300, the node first identifies, for each k, a maximum matching between the set of transmitting nodes having packet pkt_(k) and the set of receiving nodes, with the intended destination of packet pkt_(k) (e.g., in FIG. 4, node d₁ for packet pkt₁, node d₂ for packet pkt₂, etc.) being present in the maximum matching. Hereafter, the size of the identified maximum matching is denoted as m_(k).

As known from the graph theory, a matching in a graph is a set of edges that do not have common vertices. More specifically, for graph G=(V,E), where V is a set of vertices and E is a set of edges, a matching is a set of pairwise non-adjacent edges, wherein the term “non-adjacent” means that no two edges share a common vertex. A maximum matching is a matching that contains the largest possible number of edges. For a given graph G, there might be more than one maximum matching. A maximum matching should not be confused with a maximal matching. The latter is defined as a matching having the following property: if any edge that is not in the maximal matching is added to it from the graph, then the resulting set of edges is no longer a matching. While every maximum matching is also a maximal matching, the reverse is not true, i.e., not every maximal matching is a maximum matching.

Next, for each k, the node finds a set of receiving nodes having the following property. For each receiving node in the set, the transmitting nodes from the identified maximum matching do not cause signal interference. Hereafter, the size of the identified set of receiving nodes is denoted as l_(k).

Finally, the set of parameters σ_(k) is computed using Eq. (9): (9)

σ_(k) =m _(k) +l _(k)  (9)

As an example, if a transmitting node of packet pkt_(k) does not create interference at any receiver and no other transmitting node has packet pkt_(k), then m_(k)=1 and l_(k)=K−1, where K is the total number of packets considered for concurrent transmission. As with the previously described alternative algorithm for σ_(k), the computed values of σ_(k) are sorted in an ascending magnitude order so that σ_(k1)≦σ_(k2)≦ . . . σ_(k) _(K.)

The following piece of pseudo-code provides an exemplary combined implementation of steps 304/306 for method 300.

(304/306)-1: Let PKT be a set of packets to be transmitted, and |PKT| be the number of packets in PKT; (304/306)-2: Add a pseudo-sender for any packet pkt ε PKT that a receiver already has; (304/306)-3: While CanNotXmitS(PKT, ρ) is true, where ρ is the transmission rate;   σ_(k)=MaxNonIntR(PKT, k), ∀k = 1,2,...|PKT|;   Let pkt be a packet with minimal   {σ_(k)|k = 1,2,...|PKT|};   PKT = PKT − {pkt}; End while; (304/306)-4: Prune senders one by one while CanNotXmitS(PKT, ρ) is false. Note that this pseudo-code is compatible with multiple transmission rates because it explicitly includes transmission rate ρ as one of the parameters. Function MaxNonIntR(PKT, k) returns σ_(k) calculated using Eq. (9). Sub-step (304/306)-2 takes into account available side information. If a node has packet pkt εPKT and there is a suitable transmission edge, then the node can serve as a pseudo-sender. If the final solution has a pseudo-sender, then that pseudo-sender becomes one of the transmitting nodes. Sub-step (304/306)-4 finds an optimal set of transmitting nodes having a minimum possible number of transmitting nodes.

Function CanNotXmitS(PKT, ρ) used in sub-steps (304/306)-3 and (304/306)-4 provides an answer to the question of whether set PKT can be transmitted concurrently at a given transmission rate ρ. When the set cannot be transmitted, the function returns a Boolean “true.” When the set can be transmitted, the function returns a Boolean “false.”

Let us denote as Φ the coding coefficient matrix, which is defined by Eq. (10):

Y=HΦX+Z  (10)

where Y is the vector of received signals; H is the channel-state matrix; X is the vector of native signals x; and Z is the vector representing noise. The right side of Eq. (7) contains a representative example of matrix HΦ. Function CanNotXmitS(PKT, ρ) returns a Boolean “false” when matrix HΦ has only non-zero diagonal elements. Note that, when the number of transmitting nodes is different from the number of receiving nodes, matrix HΦ is not square, and one needs to take a block view of the matrix while trying to identify the diagonal elements. More specifically, in a block view of matrix HΦ, the matrix elements corresponding to different signals intended for the same receiving node are grouped together into a block and considered to be one element. For example, matrix elements H₁₁C₁ and H₄₁C₄ in the first row of the HΦ matrix shown in Eq. (7) are considered to be a single diagonal element because those matrix elements correspond to signals x₁ and x₄ intended for the same receiving node d₁ (also see FIG. 4).

The mathematical problem of diagonalizing matrix H′≡HΦ is given by Eq. (11):

$\begin{matrix} {{{minimize}\mspace{14mu} {f(W)}} - {\sum\limits_{i = 1}^{K}{w_{i}\rho}}} & (11) \end{matrix}$

where vector W=[w₁, w₂, . . . , w_(K)], and

${\sum\limits_{i = 1}^{K}w_{i}} = 1.$

Function ƒ(W) is calculated using the convex program defined by Eqs. (12a)-(12c):

$\begin{matrix} {{{maximize}\mspace{14mu} {f(W)}} = {\sum\limits_{i = 1}^{K}{w_{i}B\; {\log_{2}\left( {1 + {{h_{ii}^{\prime}}^{2}/N_{i}}} \right)}}}} & \left( {12a} \right) \\ {{\forall{i \neq j}},{{{where}\mspace{14mu} 1} \leq i},{{j \leq {K\text{:}\mspace{14mu} h_{ij}^{\prime}}} = 0}} & \left( {12b} \right) \\ {{\forall i},{{{where}\mspace{14mu} 1} \leq i \leq {K\text{:}{\underset{j = 1}{\overset{K}{\mspace{14mu}\sum}}{\varphi_{ij}}^{2}}} \leq P}} & \left( {12c} \right) \end{matrix}$

where B is the bandwidth of the channel in Hz; N_(i) is the noise at the i-th receiver; h′_(ij) are the matrix elements of matrix H′; φ_(ij) are the matrix elements of matrix Φ; and P is the maximum permitted transmitter power. In one embodiment, Eq. (11) can be programmed using a gradient approach, under which the largest transmission rate among all sender-receiver pairs gradually decreases its weight while the smallest transmission rate increases its weight until a minimum is found.

Although method 300 has been described in reference to one-hop transmission, one skilled in the art will appreciate that the method can be modified in a relatively straightforward manner to two-hop transmissions and local rerouting. For example, function MaxNonIntR used in the above-described combined implementation of steps 304/306 could be modified to compute a two-hop matching instead of a one-hop matching. Channel-state matrix H could be modified to be a product of the channel-state matrices corresponding to the first and second hops. If there are helper nodes having mixed native signals, then the modified algorithm deals with them in the following manner. First, for the smallest σ_(i), the algorithm looks for a helper node u located one hop away from receiving node d_(i) that receives a mixed signal containing native signal x_(j) corresponding to pkt_(j) εPKT, where j≠i. Then, the algorithm increases σ_(i) by one and looks for another helper node. Once node u is picked as a helper node for a certain native signal, it cannot be chosen for another packet (assuming that DOF=1). This procedure is repeated until no additional helper nodes are available to further increase σ_(i).

While this invention has been described with reference to illustrative embodiments, this description is not intended to be construed in a limiting sense.

Various modifications of the described embodiments, as well as other embodiments of the invention, which are apparent to persons skilled in the art to which the invention pertains are deemed to lie within the principle and scope of the invention as expressed in the following claims.

As used in this specification, the term “zero-forcing” refers to a signal transmission technique, according to which two or more transmitters transmit their respective RF signals so as to force, at a designated receiver, destructive interference of one or more selected signal components, wherein the destructive interference effectively nulls the component(s). The term “interference alignment” refers to a signal transmission technique, according to which two or more transmitters transmit their respective RF signals so as to achieve, at a designated receiver, collinear alignment, in the antenna space, of two or more selected signal components. Interference alignment implies that the receiver has at least two antennas, each capable of independently receiving RF signals. The term “interference cancellation” refers to a signal transmission technique, according to which a designated receiver, upon receiving an RF signal, can remove an unwanted component of that signal using a prior knowledge of the unwanted component, e.g., through the available side information.

The present invention can be embodied in the form of methods and apparatuses for practicing those methods. The present invention can also be embodied in the form of program code embodied in tangible media, such as magnetic recording media, optical recording media, solid state memory, floppy diskettes, CD-ROMs, hard drives, or any other non-transitory machine-readable storage medium, wherein, when the program code is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the invention. The present invention can also be embodied in the form of program code, for example, stored in a non-transitory machine-readable storage medium including being loaded into and/or executed by a machine, wherein, when the program code is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the invention. When implemented on a general-purpose processor, the program code segments combine with the processor to provide a unique device that operates analogously to specific logic circuits.

Unless explicitly stated otherwise, each numerical value and range should be interpreted as being approximate as if the word “about” or “approximately” preceded the value of the value or range.

It will be further understood that various changes in the details, materials, and arrangements of the parts which have been described and illustrated in order to explain the nature of this invention may be made by those skilled in the art without departing from the scope of the invention as expressed in the following claims.

The description and drawings merely illustrate the principles of the invention. It will thus be appreciated that those of ordinary skill in the art will be able to devise various arrangements that, although not explicitly described or shown herein, embody the principles of the invention and are included within its spirit and scope. Furthermore, all examples recited herein are principally intended expressly to be only for pedagogical purposes to aid the reader in understanding the principles of the invention and the concepts contributed by the inventor(s) to furthering the art, and are to be construed as being without limitation to such specifically recited examples and conditions. Moreover, all statements herein reciting principles, aspects, and embodiments of the invention, as well as specific examples thereof, are intended to encompass equivalents thereof.

It should be appreciated by those of ordinary skill in the art that any block diagrams herein represent conceptual views of illustrative circuitry embodying the principles of the invention. Similarly, it will be appreciated that any flow charts, flow diagrams, state transition diagrams, pseudo code, and the like represent various processes which may be substantially represented in computer readable medium and so executed by a computer or processor, whether or not such computer or processor is explicitly shown.

The use of figure numbers and/or figure reference labels in the claims is intended to identify one or more possible embodiments of the claimed subject matter in order to facilitate the interpretation of the claims. Such use is not to be construed as necessarily limiting the scope of those claims to the embodiments shown in the corresponding figures.

Although the elements in the following method claims, if any, are recited in a particular sequence with corresponding labeling, unless the claim recitations otherwise imply a particular sequence for implementing some or all of those elements, those elements are not necessarily intended to be limited to being implemented in that particular sequence.

Reference herein to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments necessarily mutually exclusive of other embodiments. The same applies to the term “implementation.”

Also for purposes of this description, the terms “couple,” “coupling,” “coupled,” “connect,” “connecting,” or “connected” refer to any manner known in the art or later developed in which energy is allowed to be transferred between two or more elements, and the interposition of one or more additional elements is contemplated, although not required. Conversely, the terms “directly coupled,” “directly connected,” etc., imply the absence of such additional elements.

As used herein in reference to an element and a standard, the term compatible means that the element communicates with other elements in a manner wholly or partially specified by the standard, and would be recognized by other elements as sufficiently capable of communicating with the other elements in the manner specified by the standard. The compatible element does not need to operate internally in a manner specified by the standard.

The embodiments covered by the claims in this application are limited to embodiments that (1) are enabled by this specification and (2) correspond to statutory subject matter. Non-enabled embodiments and embodiments that correspond to non-statutory subject matter are explicitly disclaimed even if they formally fall within the scope of the claims. 

1. At a first node of a wireless network, a node-implemented method for concurrent transmission of multiple radio-frequency signals between a plurality of transmitting and receiving nodes of the wireless network, the method comprising: (A) for a selected time slot, collecting packet-availability information for nodes located within a selected number of hops from the first node; (B) determining a subset of packets corresponding to the packet-availability information that is suitable for concurrent transmission in the selected time slot by considering, for the selected time slot, two or more of (i) zero-forcing, (ii) interference-alignment, and (iii) interference-cancellation; (C) identifying a set of transmitting nodes corresponding to the subset of packets; and (D) transmitting one or more trigger messages to said set of transmitting nodes to cause the concurrent transmission of the subset of packets in the selected time slot.
 2. The invention of claim 1, wherein the subset of packets determined at step (B) is a largest subset of packets suitable for concurrent transmission in the selected time slot.
 3. The invention of claim 1, wherein step (A) comprises arranging the packet-availability information in form of a packet availability matrix, in which each matrix element a_(ik) is a binary value, where i is a node ID and k is a packet ID.
 4. The invention of claim 3, wherein step (B) comprises: (B1) for each packet corresponding to the packet availability matrix, calculating a sum of matrix elements corresponding to the packet; and (B2) sorting the calculated sums according to their values.
 5. The invention of claim 3, wherein step (B) comprises: (B1) for each packet corresponding to the packet availability matrix, finding a maximum matching between a set of transmitting nodes having the packet and a set of receiving nodes, wherein the maximum matching includes a destination node for the packet.
 6. The invention of claim 5, wherein step (B) further comprises: (B2) for each packet corresponding to the packet availability matrix, finding a set of receiving nodes, for each of which the transmitting nodes from the maximum matching produce no signal interference at the receiving node; and (B3) calculating a sum of the size of the maximum matching found at step (B1) and the size of the set of receiving nodes found at step (B2).
 7. The invention of claim 1, wherein, for step (C), the set of transmitting nodes is an optimal set of transmitting nodes.
 8. The invention of claim 1, wherein, for step (C), the set of transmitting nodes comprises a helper node.
 9. The invention of claim 8, wherein the helper node had previously opportunistically received a native radio-frequency signal corresponding to a packet from the subset of packets.
 10. The invention of claim 8, wherein the helper node had previously opportunistically received a mixed radio-frequency signal corresponding to a packet from the subset of packets.
 11. The invention of claim 1, wherein a trigger message transmitted at step (D) instructs a transmitting node to reroute a packet to be transmitted by said transmitting node.
 12. The invention of claim 1, wherein step (C) comprises determining weighting coefficients for radio-frequency signals corresponding to the subset of packets so as to zero-force a first unwanted radio-frequency signal at a first receiving node.
 13. The invention of claim 12, wherein: the first receiving node has more than one antenna; and the weighting coefficients are also determined so as to align a second unwanted radio-frequency signal with a third unwanted radio-frequency signal at the first receiving node.
 14. The invention of claim 12, wherein: a second receiving node has more than one antenna; and the weighting coefficients are also determined so as to align a second unwanted radio-frequency signal with a third unwanted radio-frequency signal at the second receiving node.
 15. The invention of claim 1, wherein: at least one receiving node has more than one antenna; and step (C) comprises determining weighting coefficients for radio-frequency signals corresponding to the largest subset of packets so as to align two or more unwanted radio-frequency signals at said at least one receiving node.
 16. The invention of claim 1, wherein: at least one transmitting node has more than one antenna; and step (C) comprises determining an antenna-partition vector for said at least one transmitting node.
 17. The invention of claim 1, wherein, for step (A), the selected number of hops is two.
 18. The invention of claim 1, wherein, for step (D), a trigger message is a MAC-layer message.
 19. The invention of claim 1, wherein: a first receiving node already has one of the packets from the subset of packets; and the set of transmitting nodes found at step (C) enables the first receiving node to use said one of the packets to cancel interference from a corresponding unwanted radio-frequency signal received during the concurrent transmission in the selected time slot.
 20. A first node for a wireless network, the wireless network being adapted for concurrent transmission of multiple radio-frequency signals between a plurality of transmitting and receiving nodes, wherein the first node is adapted to: for a selected time slot, collect packet-availability information for nodes located within a selected number of hops from the first node; determine a subset of packets corresponding to the packet-availability information that is suitable for concurrent transmission in the selected time slot by considering, for the selected time slot, two or more of (i) zero-forcing, (ii) interference-alignment, and (iii) interference-cancellation; identify a set of transmitting nodes corresponding to the subset of packets; and transmit one or more trigger messages to said set of transmitting nodes to cause the concurrent transmission of the subset of packets in the selected time slot. 